Papers with constrained Viterbi procedure
Fast and Accurate End-to-End Span-based Semantic Role Labeling as Word-based Graph Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Using end-to-end span-based SRL, we propose a word-based graph parsing task for word-level representation of spans . compared with word-driven SRL, span-Based SRL is more complex due to difficulties in determining argument boundaries. |
| Approach: | They propose to cast end-to-end span-based SRL as a word-based graph parsing task . they propose a constrained Viterbi procedure to ensure the legality of the output graph . |
| Outcome: | The proposed model can parse 669/252 sentences per second without and with pre-trained models. |